Air Taxi Skyport Location Problem for Airport Access

Witnessing the rapid progress and accelerated commercialization made in recent years for the introduction of air taxi services in near future across metropolitan cities, our research focuses on one of the most important consideration for such services, i.e., infrastructure planning (also known as skyports). We consider design of skyport locations for air taxis accessing airports, where we present the skyport location problem as a modified single-allocation p-hub median location problem integrating choice-constrained user mode choice behavior into the decision process. Our approach focuses on two alternative objectives i.e., maximizing air taxi ridership and maximizing air taxi revenue. The proposed models in the study incorporate trade-offs between trip length and trip cost based on mode choice behavior of travelers to determine optimal choices of skyports in an urban city. We examine the sensitivity of skyport locations based on two objectives, three air taxi pricing strategies, and varying transfer times at skyports. A case study of New York City is conducted considering a network of 149 taxi zones and 3 airports with over 20 million for-hire-vehicles trip data to the airports to discuss insights around the choice of skyport locations in the city, and demand allocation to different skyports under various parameter settings. Results suggest that a minimum of 9 skyports located between Manhattan, Queens and Brooklyn can adequately accommodate the airport access travel needs and are sufficiently stable against transfer time increases. Findings from this study can help air taxi providers strategize infrastructure design options and investment decisions based on skyport location choices.Comment: 25 page

A dynamic ridesharing dispatch and idle vehicle repositioning strategy with integrated transit transfers

We propose a ridesharing strategy with integrated transit in which a private on-demand mobility service operator may drop off a passenger directly door-to-door, commit to dropping them at a transit station or picking up from a transit station, or to both pickup and drop off at two different stations with different vehicles. We study the effectiveness of online solution algorithms for this proposed strategy. Queueing-theoretic vehicle dispatch and idle vehicle relocation algorithms are customized for the problem. Several experiments are conducted first with a synthetic instance to design and test the effectiveness of this integrated solution method, the influence of different model parameters, and measure the benefit of such cooperation. Results suggest that rideshare vehicle travel time can drop by 40-60% consistently while passenger journey times can be reduced by 50-60% when demand is high. A case study of Long Island commuters to New York City (NYC) suggests having the proposed operating strategy can substantially cut user journey times and operating costs by up to 54% and 60% each for a range of 10-30 taxis initiated per zone. This result shows that there are settings where such service is highly warranted

A stochastic user-operator assignment game for microtransit service evaluation: A case study of Kussbus in Luxembourg

This paper proposes a stochastic variant of the stable matching model from Rasulkhani and Chow [1] which allows microtransit operators to evaluate their operation policy and resource allocations. The proposed model takes into account the stochastic nature of users' travel utility perception, resulting in a probabilistic stable operation cost allocation outcome to design ticket price and ridership forecasting. We applied the model for the operation policy evaluation of a microtransit service in Luxembourg and its border area. The methodology for the model parameters estimation and calibration is developed. The results provide useful insights for the operator and the government to improve the ridership of the service.Comment: arXiv admin note: substantial text overlap with arXiv:1912.0198

Nonparametric estimation of k-modal taste heterogeneity for group level agent-based mixed logit

Estimating agent-specific taste heterogeneity with a large information and communication technology (ICT) dataset requires both model flexibility and computational efficiency. We propose a group-level agent-based mixed (GLAM) logit approach that is estimated with inverse optimization (IO) and group-level market share. The model is theoretically consistent with the RUM model framework, while the estimation method is a nonparametric approach that fits to market-level datasets, which overcomes the limitations of existing approaches. A case study of New York statewide travel mode choice is conducted with a synthetic population dataset provided by Replica Inc., which contains mode choices of 19.53 million residents on two typical weekdays, one in Fall 2019 and another in Fall 2021. Individual mode choices are grouped into market-level market shares per census block-group OD pair and four population segments, resulting in 120,740 group-level agents. We calibrate the GLAM logit model with the 2019 dataset and compare to several benchmark models: mixed logit (MXL), conditional mixed logit (CMXL), and individual parameter logit (IPL). The results show that empirical taste distribution estimated by GLAM logit can be either unimodal or multimodal, which is infeasible for MXL/CMXL and hard to fulfill in IPL. The GLAM logit model outperforms benchmark models on the 2021 dataset, improving the overall accuracy from 82.35% to 89.04% and improving the pseudo R-square from 0.4165 to 0.5788. Moreover, the value-of-time (VOT) and mode preferences retrieved from GLAM logit aligns with our empirical knowledge (e.g., VOT of NotLowIncome population in NYC is $28.05/hour; public transit and walking is preferred in NYC). The agent-specific taste parameters are essential for the policymaking of statewide transportation projects